Certain fractional calculus and integral transform results of incomplete ℵ-functions with applications

In this paper, we study certain interesting and useful properties of incomplete $\aleph$-functions. The incomplete $\aleph$-function is an extension of the $\aleph$-function. We find several useful classical integral transforms of these functions. Further, we examine the fractional calculus with the incomplete $\aleph$-functions and point out several special cases. Finally, we give the applications of incomplete $\aleph$-functions in detecting glucose supply in human blood.     

排名聚合算法在少量长列表聚合中的性能比较分析

排名聚合将多个排名列表聚合成一个综合排名列表,可应用于推荐系统、链路预测、元搜索、提案评选等.当前已有工作从不同角度对不同排名聚合算法进行了综述、比较,但存在算法种类较少、数据统计特性不清晰、评价指标不够合理等局限性.不同排名聚合算法在提出时均声称优于已有算法,但是用于比较的方法不同,测试的数据不同,应用的场景不同,因此何种算法最能适应某一任务在很多情况下仍不甚清楚.本文基于Mallows模型,提出一套生成统计特性可控的不同类型的排名列表的算法,使用一个可应用于不同类型排名列表的通用评价指标,介绍9种排名聚合算法以及它们在聚合少量长列表时的表现.结果发现启发式方法虽然简单,但是在排名列表相似度较高、列表相对简单的情况下,能够接近甚至超过一些优化类方法的结果;列表中平局数量的增长会降低聚合排名的一致性并增加波动;列表数量的增加对聚合效果的影响呈现非单调性.整体而言,基于距离优化的分支定界方法 (FAST)优于其他各类算法,在不同类型的排名列表中表现非常稳定,能够很好地完成少量长列表的排名聚合.     

The maximum number of columns in supersaturated designs with

Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .     

Back to the future: A retrospective assessment of model‐based scenarios for the management of the shrimp fishery in French Guiana facing global change

While the number of models dedicated to predicting the consequences of alternative resource management strategies has increased, instances in which authors look back at past predictions to learn from discrepancies between these and observed developments are scarce. In the past decades, the French Guiana shrimp fishery has experienced shrimp market globalization and decreasing levels of shrimp recruitment due to environmental changes. In 2006, a bio‐economic model of this fishery was developed to simulate its possible responses to economic and environmental scenarios up to 2016. Here, we compare here these predictions to the observed trajectories. While the number of active vessels corresponds to that which was predicted, the estimated shrimp stock does not. Important driving factors had not been anticipated, including a general strike, natural disasters, and the end of the global financial crisis. These results show the importance of participative approaches involving stakeholders in the co‐construction and shared representation of scenarios. Recommendations for resource managers

• Effective fisheries resources management and a fortiori, the capacity of the fisheries to adapt to global change, requires understanding of both ecological and economics dynamics.
• The temporal trajectory of the trawling shrimp fisheries has been well monitored, and the decline of both stock and fleet is understood regarding ecological and economic changes: Changes in the environmental conditions of shrimp recruitment, and oil price increase and selling price decrease.
• However, our bio‐economic modeling work showed that, even with a good understanding of the dynamics explaining past trajectories, unpredictable events (strike, natural disasters…) have acted as other key driving factors altering the capacity of the model to represent possible futures.
• These results led us to recommend a better integration of the expertise of social and political scientists in developing models of bio‐economic systems to increase the quality of scenario predictions, and to argue for more participative approaches involving the stakeholders.

     

Decomposable super‐simple NRBIBDs with block size 4 and index 6

Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.     

On the construction of non-affine jump-diffusion models

We describe a method for construction of jump analogues of certain one-dimensional diffusion processes satisfying solvable stochastic differential equations. The method is based on the reduction of the original stochastic differential equations to the ones with linear diffusion coefficients, which are reducible to the associated ordinary differential equations, by using the appropriate integrating factor processes. The analogues are constructed by means of adding the jump components linearly into the reduced stochastic differential equations. We illustrate the method by constructing jump analogues of several diffusion processes and expand the notion of market price of risk to the resulting non-affine jump-diffusion models.     

股票市场的长记忆及其动态结构

本文提出了结合平均小波系数法和自回归原始自助法的稳健长记忆检验,蒙特卡罗模拟显示该方法对于短期记忆过程具有稳定性。基于该方法对2005年4月8日至2015年6月30日的中国、美国、香港和德国股市进行了实证分析。全局检验结果表明仅中国的股票市场存在显著的长记忆,并且风险因素无法对长记忆解释,而美国、德国和香港的股市不存在长记忆。基于递增窗口的动态Hurst指数分析显示,金融危机时期4个股市都存在显著的长记忆。2010年后,除中国股市外,其余三个股市几乎不存在长记忆现象。     

Optimal portfolio execution under time-varying liquidity constraints

In this article, we take an algorithmic approach to solve the problem of optimal execution under time-varying constraints on the depth of a limit order book (LOB). Our algorithms are within the resilience model proposed by Obizhaeva and Wang (2013) with a more realistic assumption on the order book depth; the amount of liquidity provided by an LOB market is finite at all times. For the simplest case where the order book depth stays at a fixed level for the entire trading horizon, we reduce the optimal execution problem into a one-dimensional root-finding problem which can be readily solved by standard numerical algorithms. When the depth of the order book is monotone in time, we apply the Karush-Kuhn-Tucker conditions to narrow down the set of candidate strategies. Then, we use a dichotomy-based search algorithm to pin down the optimal one. For the general case, we start from the optimal strategy subject to no liquidity constraints and iterate over execution strategy by sequentially adding more constraints to the problem in a specific fashion until primal feasibility is achieved. Numerical experiments indicate that our algorithms give comparable results to those of current existing convex optimization toolbox CVXOPT with significantly lower time complexity.     

Ill-posed problems in rheology

Experimental data are always noisy and often incomplete. This leads to ambiguities if one wants to infer from the data some functions, which are related to the measured quantity through an integral equation of the first kind. In rheology many of such so-called ill-posed problems appear. Two techniques to treat such problems, the regularization method and the maximum entropy method, are applied to the determination of the relaxation spectrum from data of small oscillatory shear flow. With simulated data from a reference spectrum it is discussed how the inferred spectrum depends on the region, in which data are available. It turns out that information about the asymptotic behavior of the measured quantity can be of great help in determining the full spectrum also from incomplete data.Dedicated to Prof. Dr. J. Meissner on the occasion of his 60th birthday.